Open Shortest Path First Weight Setting (OSPFWS) solving algorithms comparison and new method for updating weights
نویسنده
چکیده
Open shortest path first is the most commonly used intera-domain routing protocol. It selects the paths which traffic is routed within autonomous systems. OSPF calculates routes as follow. Each link is assigned weights by operator. Each node within the autonomous system computes shortest paths and creates destination tables to route data to next node along the path to its destination. Shortest paths are selected according to path cost. Path cost is determined by sum of its weight links. Then link weights determine the shortest paths, which in turn determine the routing of network traffic flow. OSPF weights setting problem is to find a set of OSPF weights that optimizes network performance. OSPF weights setting problem is an NP-hard problem. In the last couple of years, various algorithms for OSPF weights setting problem have been proposed. In this paper, we present a survey of OSPF weights setting algorithms and compare their performance; also new method for updates weights is introduced.
منابع مشابه
Parallel Tabu Search for Optimizing the OSPF Weight Setting Problem
The problem of setting the Open Shortest Path First (OSPF) weights on links such that congestion can be avoided is proved to be NP-hard. Many iterative heuristics have been applied to solve the OSPF weight setting (OSPFWS) problem. As the size of any combinatorial optimization problem increases, it becomes more difficult to find an optimum solution using sequential algorithms. Parallelization o...
متن کاملOptimizing OSPF Routing Using Accelerated Iterative Heuristic
The problem of setting Open Shortest Path First (OSPF) weights on links such that congestion can be avoided is proved to be NP-hard. Many iterative heuristics have been applied to solve the OSPF weight setting (OSPFWS) problem. As the size of any combinatorial optimization problem increases, it becomes more difficult to find an optimum solution using sequential algorithms. In this paper, we inv...
متن کاملA Genetic Algorithm for the Weight Setting Problem in OSPF Routing
With the growth of the Internet, Internet Service Providers (ISPs) try to meet the increasing traffic demand with new technology and improved utilization of existing resources. Routing of data packets can affect network utilization. Packets are sent along network paths from source to destination following a protocol. Open Shortest Path First (OSPF) is the most commonly used intra-domain Interne...
متن کاملALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملFinding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کامل